Verification of the WAP Transaction Layer Using the Model Checker SPIN
نویسنده
چکیده
This report presents a formal methodology of formalizing and verifying theTransaction Layer Protocol (WTP) design in the Wireless Application Proto-col (WAP) architecture. Corresponding to the Class 2 Transaction Service (TR-Service) definition and the Protocol (TR-Protocol) design, two models at differentabstraction levels are built with a finite state automaton (FSA) formalism. Byusing the model checker SPIN, we uncover defects in a latest approved version ofthe TR-Protocol design, which can lead to deadlock, channel buffer overflow andunfaithful refinement of the TR-Service definition. As an extended result, a set ofsafety, liveness and temporal properties is verified for the WTP to be operating ina more general environment which allows for loss and re-ordering messages.
منابع مشابه
Performance Evaluation of an Optimistic Concurrency Control Algorithm Ensuring Strong Consistency for Transaction Time Relations
In this paper, we study the performance of an access concurrency control algorithm for transaction time relations. This algorithm is based on the optimistic approach and detects conflicts as soon as possible. By using EOT marker technique, it has the merit to reduce to the maximum the period during which resources are locked in the validation phase [3]. We have, in previous works, made a formal...
متن کاملReachability checking in complex and concurrent software systems using intelligent search methods
Software system verification is an efficient technique for ensuring the correctness of a software product, especially in safety-critical systems in which a small bug may have disastrous consequences. The goal of software verification is to ensure that the product fulfills the requirements. Studies show that the cost of finding and fixing errors in design time is less than finding and fixing the...
متن کاملModeling, Verification and Testing of Web Applications Using Model Checker
The number of Web applications handling online transaction is increasing, but verification of the correctness of Web application development has been done manually. This paper proposes a method for modeling, verifying and testing Web applications. In our method, a Web application is modeled using two finite-state automata, i.e., a page automaton which specifies Web page transitions, and an inte...
متن کاملDynamic analysis of SA/RT models using Spin and modular verification
This paper presents the integrated use of the Spin Model Checker in conjunction with Structured Methods (SA/RT). The graphical model is translated into a Promela program in which we prove assertions about the desired behaviour of the system. We also provide support for modular verification, by separately verifying different components of the model and deducing the desired global properties from...
متن کاملTowards Automated Verification of P Systems Using Spin
This paper presents an approach to P systems verification using the Spin model checker. The authors have developed a tool which implements the proposed approach and can automatically transform P system specifications from P-Lingua into Promela, the language accepted by the well known model checker Spin. The properties expected for the P system are specified using some patterns, representing hig...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003